A Linear Time Algorithm for Weighted k-Fair Domination Problem in Cactus Graphs
نویسندگان
چکیده
A set D of vertices in a graph G is k-fair dominating if every vertex not adjacent to exactly k D. The weighted domination number $$\mathrm {wfd}_k(G)$$ vertex-weighted the minimum weight w(D) among all sets In addition number, some auxiliary parameters are defined. It shown that for cactus graph, and can be calculated linear time.
منابع مشابه
A Linear-Time Algorithm for the Weighted Paired-Domination Problem on Block Graphs
In a graph G = (V,E), a vertex subset S ⊆ V (G) is said to be a dominating set of G if every vertex not in S is adjacent to a vertex in S. A dominating set S of G is called a paired-dominating set of G if the induced subgraph G[S] contains a perfect matching. In this paper, we propose an O(n + m)-time algorithm for the weighted paireddomination problem on block graphs using dynamic programming,...
متن کاملLinear-Time Algorithm for the Paired-Domination Problem on Weighted Block Graphs
Given a graph G = (V,E), the domination problem is to find a minimum size vertex subset S ⊆ V (G) such that every vertex not in S is adjacent to a vertex in S. A dominating set S of G is called a paired-dominating set if the induced subgraph G[S] contains a perfect matching. The paired-domination problem involves finding a paired-dominating set S of G such that the cardinality of S is minimized...
متن کاملWeighted Efficient Domination for P5-Free Graphs in Linear Time
In a finite undirected graph G = (V,E), a vertex v ∈ V dominates itself and its neighbors. A vertex set D ⊆ V in G is an efficient dominating set (e.d. for short) of G if every vertex of G is dominated by exactly one vertex of D. The Efficient Domination (ED) problem, which asks for the existence of an e.d. in G, is known to be NP-complete for P7-free graphs but solvable in polynomial time for ...
متن کاملA Linear-time Algorithm for Broadcast Domination Problem on Interval Graphs
The broadcast domination problem of a graph G = (V,E) is to find a subset B ⊆ V such that the vertices in V \B can be dominated by some vertex in B. The difference between broadcast domination and classical domination is that each vertex v in B is assigned a power value f(v) where f(v) ≥ 1 and the vertices in distance at most f(v) to v can hear (be dominated by) v. The goal is to find the minim...
متن کاملTotal $k$-Rainbow domination numbers in graphs
Let $kgeq 1$ be an integer, and let $G$ be a graph. A {it$k$-rainbow dominating function} (or a {it $k$-RDF}) of $G$ is afunction $f$ from the vertex set $V(G)$ to the family of all subsetsof ${1,2,ldots ,k}$ such that for every $vin V(G)$ with$f(v)=emptyset $, the condition $bigcup_{uinN_{G}(v)}f(u)={1,2,ldots,k}$ is fulfilled, where $N_{G}(v)$ isthe open neighborhood of $v$. The {it weight} o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Forum
سال: 2022
ISSN: ['2662-2556']
DOI: https://doi.org/10.1007/s43069-022-00154-8